Numerical Solution of Parabolic Problems Based on a Weak Space-Time Formulation
نویسندگان
چکیده
منابع مشابه
Numerical Solution of Parabolic Problems Based on a Weak Space-Time Formulation
We investigate a weak space-time formulation of the heat equation and its use for the construction of a numerical scheme. The formulation is based on a known weak space-time formulation, with the difference that a pointwise component of the solution, which in other works is usually neglected, is now kept. We investigate the role of such a component by first using it to obtain a pointwise bound ...
متن کاملStability of Petrov-Galerkin Discretizations: Application to the Space-Time Weak Formulation for Parabolic Evolution Problems
This paper is concerned with the stability of Petrov-Galerkin discretizations with application to parabolic evolution problems in space-time weak form. We will prove that the discrete inf-sup condition for an a priori fixed Petrov-Galerkin discretization is satisfied uniformly under standard approximation and smoothness conditions without any further coupling between the discrete trialand test ...
متن کاملSpace-time Domain Decomposition for Parabolic Problems Space-time Domain Decomposition for Parabolic Problems
We analyze a space-time domain decomposition iteration, for a model advection diiusion equation in one and two dimensions. The asymptotic convergence rate is superlinear, and it is governed by the diiusion of the error across the overlap between subdomains. Hence, it depends on both the size of this overlap and the diiusion coeecient in the equation. However, it is independent of the number of ...
متن کاملA numerical scheme for solving nonlinear backward parabolic problems
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
متن کاملNumerical solution-space analysis of satisfiability problems.
The solution-space structure of the three-satisfiability problem (3-SAT) is studied as a function of the control parameter α (ratio of the number of clauses to the number of variables) using numerical simulations. For this purpose one has to sample the solution space with uniform weight. It is shown here that standard stochastic local-search (SLS) algorithms like average satisfiability (ASAT) e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Applied Mathematics
سال: 2017
ISSN: 1609-9389,1609-4840
DOI: 10.1515/cmam-2016-0027